public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
/*        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();*/
/*        System.out.println("节点的个数："+binaryTree.size(root));
        System.out.println("节点的个数："+binaryTree.size2(root));*/
/*        System.out.println("叶子节点的个数："+binaryTree.getLeafNodeCount(root));
        System.out.println("叶子节点的个数："+binaryTree.getLeafNodeCount2(root));*/

      //  System.out.println("第K层节点的个数:"+binaryTree.getKLevelNodeCount(root, 3));
       // System.out.println("获取二叉树的高度:"+binaryTree.getHeight(root));

        BinaryTree.TreeNode b = binaryTree.find(root, 'E');
        System.out.println("检测值为value的元素是否存在:"+b.val);

    }
}
